Intelligent Structural Operators for the k-way Graph Partitioning Problem
نویسنده
چکیده
ICGA 91 Intelligent Structural Operators for the k-way Graph Partitioning Problem 0 Intelligent Structural Operators for the k-way Graph Partitioning Problem Gregor von Laszewski Gesellschaft f ur Mathematik und Datenverarbeitung mbH Schlo Birlinghoven, D { 5205 St. Augustin [email protected] NorthEast Parallel Architectures Center Syracuse University 111 College Place Syracuse, NY 13244-4100
منابع مشابه
Improved COA with Chaotic Initialization and Intelligent Migration for Data Clustering
A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...
متن کاملA Multilevel k–way Partitioning Algorithm for Finite Element Meshes using Competing Ant Colonies
The self–organizing properties of ant colonies are employed to tackle the classical combinatorial optimization problem of graph partitioning. Structural information from the graph is mapped onto an environment upon which a number of colonies compete for resources. Using Genetic Programming, a Foraging Strategy is evolved which when executed by the ants in each colony leads to a restructuring of...
متن کاملA New Method, the Fusion Fission, for the Relaxed k -way Graph Partitioning Problem, and Comparisons with Some Multilevel Algorithms
In this paper a new graph partitioning problem is introduced, the relaxed k-way graph partitioning problem. It is close to the k-way, also called multi-way, graph partitioning problem, but with relaxed imbalance constraints. This problem arises in the air traffic control area. A new graph partitioning method is presented, the Fusion Fission, which can be used to resolve the relaxed k-way graph ...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملGraph Partitioning: A Heuristic Procedure to Partition Network Graphs
...................................................................................iii LIST OF FIGURES...........................................................................................iv INTRODUCTION..............................................................................................1 Scope and Motivation................................................................1 Basic D...
متن کامل